Pact-97 Contribution : Personnel Assignment as a Problem of Hierarchical Constraint Satisfaction
نویسنده
چکیده
The ConPlan project conducted by the German Research Center for Arti cial Intelligence in collaboration with the SIEDA Software house aimed at representing and solving nurse scheduling problems as a problem of optimizing constraint satisfaction. Shifts are assigned to the personnel complying with legal regulations, avoiding over-time work as far as possible and meeting as many additional requirements as possible. These requirements are encoded in a hierarchical constraint satisfaction problem (HCSP) comprising 600 to 800 variables. This paper explains on the one hand how nurse scheduling has been represented as a problem of optimizing consistency with constraints. On the other hand, the used search algorithm is described. 1
منابع مشابه
Single Assignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks
The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-...
متن کاملFinding Regions for Local Repair in Hierarchical Constraint Satisfaction
This report summarizes research work that has been presented at PACT-97 and the CP-97 workshop on theory and practice of dynamic constraint satisfaction. the foundation " Rheinland-Pfalz f ¨ ur Innovation " (grant-no. 836-38 62 61 /98). c Deutsches Forschungszentrum f ¨ ur K ¨ unstliche Intelligenz 1998 This work may not be copied or reproduced in whole or part for any commercial purpose. Permi...
متن کاملPersonnel assignment problem with hierarchical ordering constraints
Personnel assignment problem with hierarchical ordering constraints Hartford buffalo college essay easy way to write research paper apa format bibliography or works cited. Personnel assignment problem with hierarchical ordering constraints State of California ofac report car purchase Columbus, Abbotsford, Providence, nursing resume template monster Walsall personnel assignment problem with hier...
متن کاملOn the Quality of Local Search for the Quadratic Assignment Problem
Local search is widely used to solve approximately NP-complete combinatorial optimization problems. But, few is known about quality of obtained local minima, for a given neighborhood. We concentrate on one of the most diicult optimization problems, the Quadratic Assignment Problem, and we give an upper bound for the quality of solutions obtained with deepest local search. Moreover, other recent...
متن کاملParallel Implementation of Constraint Solving
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to each problem variable such that a set of constraints is satisfied. Arc-consistency algorithms remove inconsistent values from the set of values that can be assigned to a variable (its domain), thus reducing the search s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997